byKwong, Harris, author; Open SUNY Textbooks, publisher
This is a text that covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form. Hands-on exercises help students understand a concept soon after learning... Topics: Discrete mathematics, Logic, Proof techniques, Sets, Number theory, Mathematics, Computer science
This course covers the mathematical topics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis is placed on providing a context for the application of the mathematics within computer science. The analysis of algorithms requires the ability to count the... favoritefavoritefavoritefavorite ( 15 reviews ) Topics: ars digita, computer science, discrete math, logic, proof techniques, recurrence relations, basic...